Conception d'un solveur linéaire creux parallèle hybride direct-itératif. (Design of a parallel hybrid direct/iterative sparse linear solver)
نویسنده
چکیده
This thesis presents a parallel resolution method for sparse linear systems which combines effectively techniques of direct and iterative solvers using a Schur complement approach. A domain decomposition is built ; the interiors of the subdomains are eliminated by a direct method in order to use an iterative method only on the interface unknowns. The system on the interface (Schur complement) is solved thanks to an iterative method preconditioned by a global incomplete factorization. A special ordering on the Schur complement allows to build a scalable preconditioner. Algorithms minimizing the memory peak that appears during the construction of the preconditioner are presented. The memory is balanced thanks to a multiple domains per processors parallelization scheme. The methods are implemented in the Hips solver and parallel experimental results are presented on large industrial test cases.
منابع مشابه
Parallel algebraic domain decomposition solver for the solution of augmented systems
We consider the parallel iterative solution of indefinite linear systems given as augmented systems where the (1, 1) block is symmetric positive definite and the (2, 2) block is zero. Our numerical technique is based on an algebraic non overlapping domain decomposition technique that only exploits the graph of the sparse matrix. This approach to high-performance, scalable solution of large spar...
متن کاملA Parallel Full Geometric Multigrid Solver for Time Harmonic Maxwell Problems
The design of scalable parallel simulation codes for complex phenomena is challenging. For simulations that rely on PDE solution on complex 3D geometries, all the components ranging from the initialization phases to the ultimate linear system solution must be efficiently parallelized. In this paper we address the solution of 3D harmonic Maxwell’s equations using a parallel geometric full multig...
متن کاملSparse approximations of the Schur complement for parallel algebraic hybrid linear solvers in 3D
In this report we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems. In earlier works, the local Schur complements were computed exactly using a sparse direct solver. The robustness of the preconditioner comes at the price of this memory and time intensive computation that is t...
متن کاملParallel Computation of Entries of A-1
In this paper, we are concerned about computing in parallel several entries of the inverse of a large sparse matrix. We assume that the matrix has already been factorized by a direct method and that the factors are distributed. Entries are efficiently computed by exploiting sparsity of the right-hand sides and the solution vectors in the triangular solution phase. We demonstrate that in this se...
متن کاملPSPIKE: A Parallel Hybrid Sparse Linear System Solver
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, ...
متن کامل